Normalized Compression Distance of Multisets with Applications
نویسندگان
چکیده
منابع مشابه
Normalized Google Distance of Multisets with Applications
Normalized Google distance (NGD) is a relative semantic distance based on the World Wide Web (or any other large electronic database, for instance Wikipedia) and a search engine that returns aggregate page counts. The earlier NGD between pairs of search terms (including phrases) is not sufficient for all applications. We propose an NGD of finite multisets of search terms that is better for many...
متن کاملNormalized Compression Distance of Multiples
Normalized compression distance (NCD) is a parameter-free similarity measure based on compression. The NCD between pairs of objects is not sufficient for all applications. We propose an NCD of finite multisets (multiples) of objacts that is metric and is better for many applications. Previously, attempts to obtain such an NCD failed. We use the theoretical notion of Kolmogorov complexity that f...
متن کاملNormalized Compression Distance for Gene Expression Analysis
In this paper we show that the normalized compression distance can be applied to gene expression data analysis. Typically, microarray-based classification involves using a feature subset selection method in connection with a specific distance metric. The performance is dependent on the selection of the methods. With our proposed approach there is no need for feature subset or distance metric se...
متن کاملThe normalized compression distance and image distinguishability
We use an information-theoretic distortion measure called the Normalized Compression Distance (NCD), first proposed by M. Li et al., to determine whether two rectangular gray-scale images are visually distinguishable to a human observer. Image distinguishability is a fundamental constraint on operations carried out by all players in an image watermarking system. The NCD between two binary strin...
متن کاملComputation of Normalized Edit Distance and Applications
Given two strings X and Y over a finite alphabet, the normalized edit distance between X and Y, d( X , Y ) is defined as the minimum of W ( P ) / L ( P ) , where P is an editing path between X and Y , W ( P ) is the sum of the weights of the elementary edit operations of P, and L ( P ) is the number of these operations (length of P). In this paper, it is shown that in general, d ( X , Y ) canno...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Pattern Analysis and Machine Intelligence
سال: 2015
ISSN: 0162-8828,2160-9292
DOI: 10.1109/tpami.2014.2375175